2 Priority Queue

In the last lecture, we discussed algorithms for integer sorting. In this lecture we will discuss the relationship between integer sorting algorithms and priority queue data structures. It is obvious that fast priority queues imply fast sorting, since if a priority queue can do Insert and Deletemin in O(f(n)), then we can sort in O(nf(n)) by inserting all elements into the queue then calling Delete-min n times. So, we will focus in this lecture on the reverse — that is, how to make fast priority queues once we have fast sorting algorithms.